The Relaxed-Ring: a Fault-Tolerant Topology for Structured Overlay Networks
نویسندگان
چکیده
Fault-tolerance and lookup consistency are considered crucial properties for building applications on top of structured overlay networks. Many of these networks use the ring topology for the organization or their peers. The network must handle multiple joins, leaves and failures of peers while keeping the connection between every pair of successor-predecessor correct. This property makes the maintenance of the ring very costly and temporarily impossible to achieve, requiring periodic stabilization for fixing the ring. We introduce the relaxed-ring topology that does not rely on a perfect successorpredecessor relationship and it does not need any periodic maintenance. Leaves and failures are considered as the same type of event providing a fault-tolerant and selforganizing maintenance of the ring. Relaxed-ring’s limitations with respect to failure handling are formally identified, providing strong guarantees to develop applications on top of the architecture. Besides permanent failures, the paper analyses temporary failures and false suspicions caused by broken links, which are often ignored.
منابع مشابه
Improving the Peer-to-Peer Ring for Building Fault-Tolerant Grids
Peer-to-peer networks are gaining popularity in order to build Grid systems. Among different approaches, structured overlay networks using ring topology are the most preferred ones. However, one of the main problems of peer-to-peer rings is to guarantee lookup consistency in presence of multiple joins, leaves and failures nodes. Since lookup consistency and fault-tolerance are crucial propertie...
متن کاملTopology control for fault-tolerant communication in wireless ad hoc networks
Fault-tolerant communication and energy efficiency are important requirements for future-generation wireless ad hoc networks, which are increasingly being considered also for critical application domains like embedded systems in automotive and aerospace. Topology control, which enables multi-hop communication between any two network nodes via a suitably constructed overlay network, is the prima...
متن کاملOptimizing Routing in Structured Peer-to-Peer Overlay Networks Using Routing Table Redundancy
Structured peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry [3, 6, 5, 9] provide a self-organizing substrate for large-scale peer-to-peer applications. These systems provide efficient, fault-tolerant routing, object location and load balancing within a selforganization overlay network. In this paper, we show how redundant information that is collected as part of the norm...
متن کاملTopology-Aware Routing in Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for a variety of scalable and decentralized distributed applications. They provide efficient and fault-tolerant routing, object location and load balancing within a selforganizing overlay network. One important aspect of these systems is how they exploit network proximity in the underlying...
متن کاملTurning Heterogeneity into an Advantage in Overlay Routing
Distributed hash table (DHT)-based overlay networks, represented by Pastry, CAN, and Chord, offer an administration-free and fault-tolerant application-level overlay network. While elegant from a theoretical perspective, these systems have some disadvantages. First, they rely on applicationlevel routing, which may be inefficient with respect to network delays and bandwidth consumption. Second, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Processing Letters
دوره 18 شماره
صفحات -
تاریخ انتشار 2008